Formulas of One Propositional Variable in Intuitionistic Logic with the Solovay Modality
نویسندگان
چکیده
A description of the free cyclic algebra over the variety of Solovay algebras, as well as over its pyramid locally finite subvarieties is given.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملIntuitionistic implication makes model checking hard
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic FPL, and Jankov’s logic KC. We show that the model checking problem is P-complete for the implicational fragments of all these intuitionistic log...
متن کاملA Calculus of Cooperation and Game-Based Reasoning about Protocol Privacy
In 1933, Gödel [9] proposed a translation τ of intuitionistic propositional formulas into a modal language. Formula τ(F ) is obtained from formula F by placing the modality 2 in front of each subformula of formula F . He proved that if F is a theorem in intuitionistic propositional calculus IPL [12], then τ(F ) is provable in modal logic S4. The converse of this statement was later shown by McK...
متن کاملOn an Interpretation of Second Order Quantification in First Order Intuitionistic Propositional Logic
We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, , built up from propositional variables (p; q; r; : : :) and falsity (?) using conjunction (^), disjunction (_) and implication (!). Write ` to indicate that such a formula is intuitionistically valid. We show that for each variable p and formula there exists ...
متن کاملOn density of truth of the intuitionistic logic in one variable
Intuitionistic logic is an important subsystem of the classical one. In intuitionistic logic the effective interpretation and mechanical extraction of programs from proofs are allowed. The programming interpretation of intuitionistic propositional logic by simply typed lambda-calculus is a significant part of interest of computer scientists. The intuitionistic natural deductions are actually th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013